Surjective Additive Rank-1 Preservers on Hessenberg Matrices
نویسندگان
چکیده
منابع مشابه
Ela Additive Preservers of Tensor Product of Rank One Hermitian Matrices
Let K be a field of characteristic not two or three with an involution and F be its fixed field. Let Hm be the F -vector space of all m-square Hermitian matrices over K. Let ρm denote the set of all rank-one matrices in Hm. In the tensor product space ⊗ k i=1 Hmi , let ⊗ k i=1 ρmi denote the set of all decomposable elements ⊗ k i=1 Ai such that Ai ∈ ρmi , i = 1, . . . , k. In this paper, additi...
متن کاملA Hessenberg Reduction Algorithm for Rank Structured Matrices
In this paper we show how to perform the Hessenberg reduction of a rank structured matrix under unitary similarity operations in an efficient way, using the Givens-weight representation which we introduced in an earlier paper. This reduction can be used as a first step for eigenvalue computation. We also show how the algorithm can be modified to compute the bidiagonal reduction of a rank struct...
متن کاملPermanents of Hessenberg (0, 1)-matrices
Let P (m,n) denote the maximum permanent of an n-by-n lower Hessenberg (0, 1)-matrix with m entries equal to 1. A “staircased” structure for some matrices achieving this maximum is obtained, and recursive formulas for computing P (m,n) are given. This structure and results about permanents are used to determine the exact values of P (m,n) for n ≤ m ≤ 8n/3 and for all nnz(Hn) − nnz(Hbn/2c) ≤ m ≤...
متن کامل5 M ay 2 00 5 Jacobians and rank 1 perturbations relating to unitary Hessenberg matrices
In a recent work Killip and Nenciu gave random recurrences for the characteristic polynomials of certain unitary and real orthogonal upper Hessenberg matrices. The corresponding eigenvalue p.d.f.’s are β-generalizations of the classical groups. Left open was the direct calculation of certain Jacobians. We provide the sought direct calculation. Furthermore, we show how a multiplicative rank 1 pe...
متن کاملBetter Distance Preservers and Additive Spanners
Wemake improvements to the current upper bounds on pairwise distance preservers and additive spanners. A distance preserver is a sparse subgraph that exactly preserves all distances in a given pair set P . We show that every undirected unweighted graph has a distance preserver on O(max{n|P |, n|P |}) edges, and we conjecture that O(n|P |+ n) is possible. An additive subset spanner is a sparse s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2019
ISSN: 1081-3810
DOI: 10.13001/1081-3810.3514